const github.com/klauspost/compress/zstd.bestLongTableBits

10 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L15: 	bestLongTableBits = 22                     // Bits used in the long match table
		enc_best.go#L16: 	bestLongTableSize = 1 << bestLongTableBits // Size of the table
		enc_best.go#L203: 		nextHashL := hashLen(cv, bestLongTableBits, bestLongLen)
		enc_best.go#L309: 			candidateL = e.longTable[hashLen(cv, bestLongTableBits, bestLongLen)]
		enc_best.go#L310: 			candidateL2 := e.longTable[hashLen(cv2, bestLongTableBits, bestLongLen)]
		enc_best.go#L333: 					nextHashL := hashLen(load6432(src, sAt), bestLongTableBits, bestLongLen)
		enc_best.go#L384: 				h0 := hashLen(cv0, bestLongTableBits, bestLongLen)
		enc_best.go#L444: 			h0 := hashLen(cv0, bestLongTableBits, bestLongLen)
		enc_best.go#L527: 			h := hashLen(cv, bestLongTableBits, bestLongLen)
		enc_best.go#L537: 				h := hashLen(cv, bestLongTableBits, bestLongLen)